New multisignature scheme for specified group of verifiers
نویسندگان
چکیده
In 2004, Zhang and Xiao proposed a multisignature scheme based on ElGamal discrete logarithm algorithm which allows a signer group to sign a signature and a verifier group to verify the validity of the signed signature. In this paper, we will show that any verifier in the verifier group can break their scheme by replacing the valid signed message with another forged one which will also be authentic according to their scheme.
منابع مشابه
Security of a multisignature scheme for specified group of verifiers
A multisignature scheme for specified group of verifiers needs a group of signers cooperation to sign a message to a specified group of verifiers that must cooperate to check the signature s validity later. Recently, Zhang et al. proposed a new multisignature scheme for specified group of verifiers. However, we find that Zhang et al. s scheme cannot prevent a dishonest clerk of signing group fr...
متن کاملImprovement of Laih and Yen's multisignature scheme.
A new attack is proposed to show that a specified group of verifiers can cooperate to forge the signature for any message by secret key substitution due to the leaked secret key or by the group public key adjustment because of the renewed members. This paper presents the improvement scheme which overcomes the security weakness of Laih and Yen's scheme.
متن کاملMulti-Designated Verifiers Signatures Revisited
Multi-Designated Verifier Signatures (MDVS) are privacy-oriented signatures that can only be verified by a set of users specified by the signer. We propose two new generic constructions of MDVS from variants of existing cryptographic schemes, which are ring signature from anonymous subset and multi-chameleon hash. We first devise a single add-on protocol which enables many existing identity-bas...
متن کاملStructured multisignature algorithms - Computers and Digital Techniques, IEE Proceedings-
A structured multisignature scheme is an order-sensitive multisignature scheme that allows participating signers to sign messages in compliance with a specified signing order. It has been shown that the Burmester et al. order-sensitive multisignature scheme cannot prevent all signers producing a valid multisignature without following the specified signing order. The paper proposes two structure...
متن کاملMultisignature Scheme Based on Discrete Logarithms in the Plain Public Key Model
In this paper, we propose a new multisignature scheme based on discrete logarithms. We show that this new scheme can resist existential forgeries against adaptive chosen-message attacks in the random oracle model. The main contribution is that our security model gets rid of the special security requirement on the generation of the signers’ public keys. Adversaries are not required to reveal pri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 157 شماره
صفحات -
تاریخ انتشار 2004